from Crypto.Util.number import *
import gmpy2 as gp
from secert import flag
assert len(flag)==42
e=0x10001
m=bytes_to_long(flag)
p=getPrime(160)
q=gp.next_prime(p)
n=p*q
c=pow(m,e,n)
print('n=',n)
print('c=',c)
"""
n= 1938198674432811161450690669878250944830265839396906617662062291196152960227589796372087441130963
c= 90170164274936424192415483102025065297184726282389841586708984518420677588910796600189918035116
"""
